Robust Independence Tests with Finite Sample Guarantees for Synchronous Stochastic Linear Systems
نویسندگان
چکیده
The paper introduces robust independence tests with non-asymptotically guaranteed significance levels for stochastic linear time-invariant systems, assuming that the observed outputs are synchronous, which means systems driven by jointly i.i.d. noises. Our method provides bounds type I error probabilities distributionfree, i.e., innovations can have arbitrary distributions. algorithm combines confidence region estimates permutation and general dependence measures, such as Hilbert-Schmidt criterion distance covariance, to detect any nonlinear between systems. We also prove consistency of our hypothesis under mild assumptions demonstrate ideas through example autoregressive
منابع مشابه
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملRobust Guarantees of Stochastic Greedy Algorithms
In this paper we analyze the robustness of stochastic variants of the greedy algorithm for submodular maximization. Our main result shows that for maximizing a monotone submodular function under a cardinality constraint, iteratively selecting an element whose marginal contribution is approximately maximal in expectation is a sufficient condition to obtain the optimal approximation guarantee wit...
متن کاملTight Bounds for the Expected Risk of Linear Classifiers and PAC-Bayes Finite-Sample Guarantees
We analyze the expected risk of linear classifiers for a fixed weight vector in the “minimax” setting. That is, we analyze the worst-case risk among all data distributions with a given mean and covariance. We provide a simpler proof of the tight polynomial-tail bound for general random variables. For sub-Gaussian random variables, we derive a novel tight exponentialtail bound. We also provide n...
متن کاملRobust Finite-Time H∞ Filtering for Itô Stochastic Systems
This paper investigates the problem of robust finite-time H∞ filter design for Itô stochastic systems. Based on linear matrix inequalities (LMIS) techniques and stability theory of stochastic differential equations, stochastic Lyapunov function method is adopted to design a finite-time H∞ filter such that, for all admissible uncertainties, the filtering error system is stochastic finite-time st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2023
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2023.3287797